5 research outputs found
Linear solvers for power grid optimization problems: a review of GPU-accelerated linear solvers
The linear equations that arise in interior methods for constrained
optimization are sparse symmetric indefinite and become extremely
ill-conditioned as the interior method converges. These linear systems present
a challenge for existing solver frameworks based on sparse LU or LDL^T
decompositions. We benchmark five well known direct linear solver packages
using matrices extracted from power grid optimization problems. The achieved
solution accuracy varies greatly among the packages. None of the tested
packages delivers significant GPU acceleration for our test cases
Towards Efficient Alternating Current Optimal Power Flow Analysis on Graphical Processing Units
We present a solution of sparse alternating current optimal power flow
(ACOPF) analysis on graphical processing unit (GPU). In particular, we discuss
the performance bottlenecks and detail our efforts to accelerate the linear
solver, a core component of ACOPF that dominates the computational time. ACOPF
analyses of two large-scale systems, synthetic Northeast (25,000 buses) and
Eastern (70,000 buses) U.S. grids [1], on GPU show promising speed-up compared
to analyses on central processing unit (CPU) using a state-of-the-art solver.
To our knowledge, this is the first result demonstrating a significant
acceleration of sparse ACOPF on GPUs
Efficient exascale discretizations: High-order finite element methods
© The Author(s) 2021.Efficient exploitation of exascale architectures requires rethinking of the numerical algorithms used in many large-scale applications. These architectures favor algorithms that expose ultra fine-grain parallelism and maximize the ratio of floating point operations to energy intensive data movement. One of the few viable approaches to achieve high efficiency in the area of PDE discretizations on unstructured grids is to use matrix-free/partially assembled high-order finite element methods, since these methods can increase the accuracy and/or lower the computational time due to reduced data motion. In this paper we provide an overview of the research and development activities in the Center for Efficient Exascale Discretizations (CEED), a co-design center in the Exascale Computing Project that is focused on the development of next-generation discretization software and algorithms to enable a wide range of finite element applications to run efficiently on future hardware. CEED is a research partnership involving more than 30 computational scientists from two US national labs and five universities, including members of the Nek5000, MFEM, MAGMA and PETSc projects. We discuss the CEED co-design activities based on targeted benchmarks, miniapps and discretization libraries and our work on performance optimizations for large-scale GPU architectures. We also provide a broad overview of research and development activities in areas such as unstructured adaptive mesh refinement algorithms, matrix-free linear solvers, high-order data visualization, and list examples of collaborations with several ECP and external applications